منابع مشابه
Limits on jump inversion for strong reducibilities
We show that Sacks’ and Shoenfield’s analogs of jump inversion fail for both ttand wttreducibilities in a strong way. In particular we show that there is a ∆2 set B >tt ∅ ′ such that there is no c.e. set A with A′ ≡wtt B . We also show that there is a Σ 0 2 set C >tt ∅ ′ such that there is no ∆2 set D with D′ ≡wtt C . §
متن کاملBeyond Strong Jump Traceability
Strong jump traceability has been studied by various authors. In this paper we study a variant of strong jump traceability by looking at a partial relativization of traceability. We discover a new subclass H of the c.e. K-trivials with some interesting properties. These sets are computationally very weak, but yet contains a cuppable member. Surprisingly they cannot be constructed using cost fun...
متن کاملA jump inversion theorem for the enumeration jump
We prove a jump inversion theorem for the enumeration jump and a minimal pair type theorem for the enumeration reducibilty. As an application some results of Selman, Case and Ash are obtained.
متن کاملSuperhighness and Strong Jump Traceability
Let A be c.e. Then A is strongly jump traceable if and only if A is Turing below each superhigh Martin-Löf-random set.
متن کاملPseudo - Jump Inversion and Sjt - Hard Sets
There are noncomputable c.e. sets, computable from every SJT-hard c.e. set. This yields a natural pseudo-jump operator, increasing on all sets, which cannot be inverted back to a minimal pair or even avoiding an upper cone.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic and Computation
سال: 2018
ISSN: 0955-792X,1465-363X
DOI: 10.1093/logcom/exy025